A convergence analysis for nonsymmetric Lanczos algorithms
نویسندگان
چکیده
منابع مشابه
A Convergence Analysis for Nonsymmetric Lanczos Algorithms
A convergence analysis for the nonsymmetric Lanczos algorithm is presented. By using a tridiagonal structure of the algorithm, some identities concerning Ritz values and Ritz vectors are established and used to derive approximation bounds. In particular, the analysis implies the classical results for the symmetric Lanczos algorithm.
متن کاملA Breakdown-free Variation of the Nonsymmetric Lanczos Algorithms
The nonsymmetric Lanczos tridiagonalization algorithm is essentially the Gram-Schmidt biorthogonalization method for generating biorthogonal bases of a pair of Krylov subspaces. It suffers from breakdown and instability when a pivot at some step is zero or nearly zero, which is often the result of mismatch of the two Krylov subspaces. In this paper, we propose to modify one of the two Krylov su...
متن کاملOn Asymptotic Convergence of Nonsymmetric Jacobi Algorithms
The asymptotic convergence behavior of cyclic versions of the nonsymmetric Jacobi algorithm for the computation of the Schur form of a general complex matrix is investigated. Similar to the symmetric case, the nonsymmetric Jacobi algorithm proceeds by applying a sequence of rotations that annihilate a pivot element in the strict lower triangular part of the matrix until convergence to the Schur...
متن کاملRestarting the Nonsymmetric Lanczos Algorithm
A restarted nonsymmetric Lanczos algorithm is given for computing eigenvalus and both right and left eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Restarting also makes it possible to deal with roundoff error in new ways. We give a scheme for avoiding near-breakdown and discuss maintaining biorthogonality. A system of linear equations can be solved s...
متن کاملError Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
This paper presents an error analysis of the Lanczos algorithm in finite-precision arithmetic for solving the standard nonsymmetric eigenvalue problem, if no breakdown occurs. An analog of Paige's theory on the relationship between the loss of orthogonality among the Lanczos vectors and the convergence of Ritz values in the symmetric Lanczos algorithm is discussed. The theory developed illustra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1991
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1991-1068826-4